Answer changing in multiple choice assessment change that answer when in doubt – and spread the word!

<p>Abstract</p> <p>Background</p> <p>Several studies during the last decades have shown that answer changing in multiple choice examinations is generally beneficial for examinees. In spite of this the common misbelief still prevails that answer changing in multiple choice examinations results in an increased number of wrong answers rather than an improved score. One suggested consequence of newer studies is that examinees should be informed about this misbelief in the hope that this prejudice might be eradicated. This study aims to confirm data from previous studies about the benefits of answer changing as well as pursue the question of whether students informed about the said advantageous effects of answer changing would indeed follow this advice and change significantly more answers. Furthermore a look is cast on how the overall examination performance and mean point increase of these students is affected.</p> <p>Methods</p> <p>The answer sheets to the end of term exams of 79 3^rdyear medical students at the University of Munich were analysed to confirm the benefits of answer changing. Students taking the test were randomized into two groups. Prior to taking the test 41 students were informed about the benefits of changing answers after careful reconsideration while 38 students did not receive such information. Both groups were instructed to mark all answer changes made during the test.</p> <p>Results</p> <p>Answer changes were predominantly from wrong to right in full accordance with existing literature resources. It was shown that students who had been informed about the benefits of answer changing when in doubt changed answers significantly more often than students who had not been informed. Though students instructed on the benefits of changing answers scored higher in their exams than those not instructed, the difference in point increase was not significant.</p> <p>Conclusion</p> <p>Students should be informed about the benefits of changing initial answers to multiple choice questions once when in reasonable doubt about these answers. Furthermore, reconsidering answers should be encouraged as students will heed the advice and change more answers than students not so instructed.</p

An Appreciation of the Scientific Researches of Dr Peter H. Dawson

Upon the death of Peter H. Dawson in 2015, mass spectrometry lost a major figure. Within the area of radiofrequency quadrupole electric fields applied to mass spectrometry, Dawson stands alongside its pioneers Wolfgang Paul, Nobelist and inventor of the technology, and Wilson Brubaker, who identified and overcame the deleterious effects of fringing electric fields on quadrupole mass filter performance. Seventy‐one of Dawson's 97 scientific publications are concerned with quadrupole mass analyzers, ion traps and monopole mass spectrometers. Of especial note are his book and review articles in which he disseminated information on the theoretical fundamentals and practicalities of these systems to a wider audience, thereby having a major impact on the development of this important field of endeavour. The scientific researches of Dr Dawson and his advice and counsel, influenced to a major degree, and to the better, the research careers, teachings and the lives of the authors of this piece. Their combined researches quadrupole devices led to the commercialization of the ion trap as a mass spectrometer by which mass spectral information became available at greatly reduced cost. Thus, the advent of commercial ion trapping instruments permitted a greater use of mass spectrometry in both technically advanced countries and those less well advanced. The greatest impact in health services was mass spectrometric analysis of environmental problems, well and stream water, food free of pesticides, etc., and forensic sciences. Our combined indebtedness to Dr Dawson is manifested by this appreciation of his scientific work, the highlighting of his main contributions, and creation of a substantive reference source to his work that can be used by other scientists. A comprehensive list of Dr Dawson's publications, including abstracts or summaries, has been arranged in chronological order of date of submission

Encodings of Range Maximum-Sum Segment Queries and Applications

Given an array A containing arbitrary (positive and negative) numbers, we consider the problem of supporting range maximum-sum segment queries on A: i.e., given an arbitrary range [i,j], return the subrange [i' ,j' ] \subseteq [i,j] such that the sum of the numbers in A[i'..j'] is maximized. Chen and Chao [Disc. App. Math. 2007] presented a data structure for this problem that occupies {\Theta}(n) words, can be constructed in {\Theta}(n) time, and supports queries in {\Theta}(1) time. Our first result is that if only the indices [i',j'] are desired (rather than the maximum sum achieved in that subrange), then it is possible to reduce the space to {\Theta}(n) bits, regardless the numbers stored in A, while retaining the same construction and query time. We also improve the best known space lower bound for any data structure that supports range maximum-sum segment queries from n bits to 1.89113n - {\Theta}(lg n) bits, for sufficiently large values of n. Finally, we provide a new application of this data structure which simplifies a previously known linear time algorithm for finding k-covers: i.e., given an array A of n numbers and a number k, find k disjoint subranges [i_1 ,j_1 ],...,[i_k ,j_k ], such that the total sum of all the numbers in the subranges is maximized.Comment: 19 pages + 2 page appendix, 4 figures. A shortened version of this paper will appear in CPM 201

Arachnidism, scorpionism and ophidism in Ouro Preto Municipality, Minas Gerais State, Brazil

Abstract: INTRODUCTION This retrospective study shows the profile of arachnidism, ophidism, and scorpionism in the Ouro Preto Municipality, Brazil, from January 2007 to December 2013. METHODS The data were gathered from forms of the Epidemiological Surveillance Sector of the town's Health's Municipal Secretary. RESULTS Of the 412 envenomations, 308 were caused by spiders, 78 by scorpions, and 26 by snakes. The highest number of incidents involved people aged 20-34 years. Females were more affected than males. There were no reports of death. CONCLUSIONS The results show that envenomations caused by spiders, scorpions and snakes have decreased in recent years

Disturbance and Recovery of Salt Marsh Arthropod Communities following BP Deepwater Horizon Oil Spill

Oil spills represent a major environmental threat to coastal wetlands, which provide a variety of critical ecosystem services to humanity. The U.S. Gulf of Mexico is a hub of oil and gas exploration activities that historically have impacted intertidal habitats such as salt marsh. Following the BP Deepwater Horizon oil spill, we sampled the terrestrial arthropod community and marine invertebrates found in stands of Spartina alterniflora, the most abundant plant in coastal salt marshes. Sampling occurred in 2010 as oil was washing ashore and a year later in 2011. In 2010, intertidal crabs and terrestrial arthropods (insects and spiders) were suppressed by oil exposure even in seemingly unaffected stands of plants; however, Littoraria snails were unaffected. One year later, crab and arthropods had largely recovered. Our work is the first attempt that we know of assessing vulnerability of the salt marsh arthropod community to oil exposure, and it suggests that arthropods are both quite vulnerable to oil exposure and quite resilient, able to recover from exposure within a year if host plants remain healthy

Threshold intensity factors as lower boundaries for crack propagation in ceramics

BACKGROUND: Slow crack growth can be described in a v (crack velocity) versus K(I )(stress intensity factor) diagram. Slow crack growth in ceramics is attributed to corrosion assisted stress at the crack tip or at any pre-existing defect in the ceramic. The combined effect of high stresses at the crack tip and the presence of water or body fluid molecules (reducing surface energy at the crack tip) induces crack propagation, which eventually may result in fatigue. The presence of a threshold in the stress intensity factor, below which no crack propagation occurs, has been the subject of important research in the last years. The higher this threshold, the higher the reliability of the ceramic, and consequently the longer its lifetime. METHODS: We utilize the Irwin K-field displacement relation to deduce crack tip stress intensity factors from the near crack tip profile. Cracks are initiated by indentation impressions. The threshold stress intensity factor is determined as the time limit of the tip stress intensity when the residual stresses have (nearly) disappeared. RESULTS: We determined the threshold stress intensity factors for most of the all ceramic materials presently important for dental restorations in Europe. Of special significance is the finding that alumina ceramic has a threshold limit nearly identical with that of zirconia. CONCLUSION: The intention of the present paper is to stress the point that the threshold stress intensity factor represents a more intrinsic property for a given ceramic material than the widely used toughness (bend strength or fracture toughness), which refers only to fast crack growth. Considering two ceramics with identical threshold limits, although with different critical stress intensity limits, means that both ceramics have identical starting points for slow crack growth. Fast catastrophic crack growth leading to spontaneous fatigue, however, is different. This growth starts later in those ceramic materials that have larger critical stress intensity factors

Information processing using a single dynamical node as complex system

Novel methods for information processing are highly desired in our information-driven society. Inspired by the brain's ability to process information, the recently introduced paradigm known as 'reservoir computing' shows that complex networks can efficiently perform computation. Here we introduce a novel architecture that reduces the usually required large number of elements to a single nonlinear node with delayed feedback. Through an electronic implementation, we experimentally and numerically demonstrate excellent performance in a speech recognition benchmark. Complementary numerical studies also show excellent performance for a time series prediction benchmark. These results prove that delay-dynamical systems, even in their simplest manifestation, can perform efficient information processing. This finding paves the way to feasible and resource-efficient technological implementations of reservoir computing

Assessing fossil fuel CO₂ emissions in California using atmospheric observations and models

Analysis systems incorporating atmospheric observations could provide a powerful tool for validating fossil fuel CO2 (ffCO2) emissions reported for individual regions, provided that fossil fuel sources can be separated from other CO2 sources or sinks and atmospheric transport can be accurately accounted for. We quantified ffCO2 by measuring radiocarbon (14C) in CO2, an accurate fossil-carbon tracer, at nine observation sites in California for three months in 2014–15. There is strong agreement between the measurements and ffCO2 simulated using a high-resolution atmospheric model and a spatiotemporally-resolved fossil fuel flux estimate. Inverse estimates of total in-state ffCO2 emissions are consistent with the California Air Resources Board's reported ffCO2 emissions, providing tentative validation of California's reported ffCO2 emissions in 2014–15. Continuing this prototype analysis system could provide critical independent evaluation of reported ffCO2 emissions and emissions reductions in California, and the system could be expanded to other, more data-poor regions

Longest Common Extensions in Trees

The longest common extension (LCE) of two indices in a string is the length of the longest identical substrings starting at these two indices. The LCE problem asks to preprocess a string into a compact data structure that supports fast LCE queries. In this paper we generalize the LCE problem to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and rooted tree $T$ of size $n$, the goal is to preprocess $T$ into a compact data structure that support the following LCE queries between subpaths and subtrees in $T$. Let $v_1$, $v_2$, $w_1$, and $w_2$ be nodes of $T$ such that $w_1$ and $w_2$ are descendants of $v_1$ and $v_2$ respectively. \begin{itemize} \item \LCEPP(v_1, w_1, v_2, w_2): (path-path \LCE) return the longest common prefix of the paths $v_1 \leadsto w_1$ and $v_2 \leadsto w_2$. \item \LCEPT(v_1, w_1, v_2): (path-tree \LCE) return maximal path-path LCE of the path $v_1 \leadsto w_1$ and any path from $v_2$ to a descendant leaf. \item \LCETT(v_1, v_2): (tree-tree \LCE) return a maximal path-path LCE of any pair of paths from $v_1$ and $v_2$ to descendant leaves. \end{itemize} We present the first non-trivial bounds for supporting these queries. For \LCEPP queries, we present a linear-space solution with $O(\log^{*} n)$ query time. For \LCEPT queries, we present a linear-space solution with $O((\log\log n)^{2})$ query time, and complement this with a lower bound showing that any path-tree LCE structure of size O(n \polylog(n)) must necessarily use $\Omega(\log\log n)$ time to answer queries. For \LCETT queries, we present a time-space trade-off, that given any parameter $\tau$, $1 \leq \tau \leq n$, leads to an $O(n\tau)$ space and $O(n/\tau)$ query-time solution. This is complemented with a reduction to the the set intersection problem implying that a fast linear space solution is not likely to exist